Deductive query languages for recursively typed complex objects
نویسندگان
چکیده
منابع مشابه
Query processing for complex objects
Harder, T., B Mitschang and H Schoning, Query processing for complex objects, Data & Knowledge Engmeenng 7 (1992) 181-200. Over the last few years several new data models together with their languages have been developed to meet the increasing reqmrements of engineering or office applications A major characteristic of these data models is their ability to process and manage complex objects whic...
متن کاملDatabase Query Languages Embedded in the Typed Lambda Calculus
We investigate the expressive power of the typed-calculus when expressing computations over nite structures, i.e., databases. We show that the simply typed-calculus can express various database query languages such as the relational algebra, xpoint logic, and the complex object algebra. In our embeddings, inputs and outputs are-terms encoding databases, and a program expressing a query is a-ter...
متن کاملTyped Closure Conversion for Recursively-deened Functions (extended Abstract)
Much recent work on the compilation of statically typed languages such as ML relies on the propagation of type information from source to object code in order to increase the reliability and maintainabilty of the compiler itself and to improve the eeciency and veriiability of generated code. To achieve this the program transformations performed by a compiler must be cast as type-preserving tran...
متن کاملEquality sets for recursively enumerable languages
We consider shifted equality sets of the form EG(a, g1, g2) = {w | g1(w) = ag2(w)}, where g1 and g2 are nonerasing morphisms and a is a letter. We are interested in the family consisting of the languages h(EG(J)), where h is a coding and EG(J) is a shifted equality set. We prove several closure properties for this family. Moreover, we show that every every recursively enumerable language L ⊆ A∗...
متن کاملReflection for Statically Typed Languages
An object-oriented language that permits changing the behavior of a class or of a single object is said to support computational reflection. Existing reflective facilities in object-oriented languages are either complex, type unsafe, or have a large performance penalty. We propose a simple, easy-to-understand, and statically typed model that captures much of the functionalities of other reflect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1998
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(97)10009-7